The Merge-and-Shrink Planner: Bisimulation-based Abstraction for Optimal Planning
نویسندگان
چکیده
Merge-and-shrink abstraction is a general approach to heuristic design whose key advantage is its capability to make very fine-grained choices in defining abstractions. The Mergeand-shrink planner uses two different strategies for making these choices, both based on the well-known notion of bisimulation. The resulting heuristics are used in two sequential runs of A∗ search.
منابع مشابه
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning
A∗ with admissible heuristics is a very successful approach to optimal planning. But how to derive such heuristics automatically? Merge-and-shrink abstraction (M&S) is a general approach to heuristic design whose key advantage is its capability to make very fine-grained choices in defining abstractions. However, little is known about how to actually make these choices. We address this via the w...
متن کاملAn algorithm for computing bisimulations in planning
Merge-and-shrink abstractions are a popular approach to generate abstraction heuristics for planning. The computation of merge-and-shrink abstractions relies on a merging and a shrinking strategy. A recently investigated shrinking strategy is based on using bisimulations. Bisimulations are guaranteed to produce perfect heuristics. In this thesis we investigate an efficient algorithm proposed by...
متن کاملRefining abstraction heuristics with mutexes
Planning as heuristic search is a powerful approach to solve domain-independent planning problems. An important class of heuristics is based on abstractions of the original planning task. However it comes with loss in precision. The contribution of this thesis is the concept of constrained abstraction heuristics in general, and the application of this concept to pattern database and merge and s...
متن کاملOptimal Additive Composition of Abstraction-based Admissible Heuristics
We describe a procedure that takes a classical planning task, a forward-search state, and a set of abstraction-based admissible heuristics, and derives an optimal additive composition of these heuristics with respect to the given state. Most importantly, we show that this procedure is polynomial-time for arbitrary sets of all known to us abstraction-based heuristics such as PDBs, constrained PD...
متن کاملFocusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink
Merge-and-shrink (M&S) is a framework to generate abstraction heuristics for cost-optimal planning. A recent approach computes simulation relations on a set of M&S abstractions in order to identify states that are better than others. This relation is then used for pruning states in the search when a “better” state is already known. We propose the usage of simulation relations inside the M&S fra...
متن کامل